首页> 外文OA文献 >Duelist Algorithm: An Algorithm Inspired by How Duelist Improve Their Capabilities in a Duel
【2h】

Duelist Algorithm: An Algorithm Inspired by How Duelist Improve Their Capabilities in a Duel

机译:Duelist算法:一种由Duelist如何改进他们的灵感启发的算法   决斗中的能力

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

This paper proposes an optimization algorithm based on how human fight andlearn from each duelist. Since this algorithm is based on population, theproposed algorithm starts with an initial set of duelists. The duel is todetermine the winner and loser. The loser learns from the winner, while thewinner try their new skill or technique that may improve their fightingcapabilities. A few duelists with highest fighting capabilities are called aschampion. The champion train a new duelists such as their capabilities. The newduelist will join the tournament as a representative of each champion. Allduelist are re-evaluated, and the duelists with worst fighting capabilities iseliminated to maintain the amount of duelists. Two optimization problem isapplied for the proposed algorithm, together with genetic algorithm, particleswarm optimization and imperialist competitive algorithm. The results show thatthe proposed algorithm is able to find the better global optimum and fasteriteration.
机译:本文提出了一种基于人类如何与每个决斗者学习和学习的优化算法。由于该算法基于种群,因此提出的算法从一组初始的决斗清单开始。决斗是确定赢家和输家。失败者向获胜者学习,而获胜者则尝试他们的新技能或技巧,这些技巧可以提高他们的战斗力。一些具有最高战斗能力的决斗者称为阿尚。冠军训练了新的决斗者,例如他们的能力。新成员将作为每个冠军的代表参加比赛。重新评估Allduelist,并消除战斗能力最差的Duelist,以保持Duelist的数量。该算法提出了两个优化问题,分别是遗传算法,粒子热优化和帝国竞争算法。结果表明,该算法能够找到较好的全局最优值和迭代速度。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号